solving quadratic assignment problem (qap) using invasive weed optimization algorithm
نویسندگان
چکیده
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones which had been applied to solve the addressed problem. the results indicate that the algorithm outperforms the competitive ones for a sizable number of the problems as the problems’ dimensions increase.
منابع مشابه
A Genetic Algorithm for solving Quadratic Assignment Problem(QAP)
The Quadratic Assignment Problem (QAP) is one of the models used for the multi-row layout problem with facilities of equal area. There are a set of n facilities and a set of n locations. For each pair of locations, a distance is specified and for each pair of facilities a weight or flow is specified (e.g., the amount of supplies transported between the two facilities). The problem is to assign ...
متن کاملSolving the Manufacturing Cell Design Problem via Invasive Weed Optimization
Manufacturing plants are commonly organized in cells containing machines that process different parts of a given product. The Manufacturing Cell Design Problem (MCDP) aims at efficiently organizing the machines into cells in order to increase productivity by minimizing the inter-cell moves of parts. In this paper, we present a new approach based on Invasive Weed Optimization (IWO) for solving s...
متن کاملA Solution Method for the Quadratic Assignment Problem (QAP)
The classic Quadratic Assignment Problem (QAP) is one of the most interesting and challenging combinatorial optimization problems in existence. Since QAP is NP-complete, it is notoriously difficult to be solved by exact solution methods. This paper focuses on the intelligent solution methods, particularly, genetic algorithms, and related development on QAP. A hybrid genetic algorithm is devised...
متن کاملSolving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization
Several real-life applications can be stated in terms of the Quadratic Assignment Problem. Finding an optimal assignment is computationally very difficult, for many useful instances. We address this problem using a local search technique, based on Extremal Optimization and present experimental evidence that this approach is competitive. Moreover, cooperative parallel versions of our solver impr...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مهندسی صنایعجلد ۴۵، شماره Special Issue، صفحات ۱۱۳-۱۲۵
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023